Proonite Categories and Semidirect Products

نویسنده

  • P. Gomes Teixeira
چکیده

After developing a theory of implicit operations and proving an analogue of Reiterman's theorem for categories, this paper addresses two complementary questions for semidirect products and two-sided semidirect products of pseudovarieties of semigroups: to determine when a pseudoidentity is valid in it, and to nd a basis of pseudoidentities. The rst question involves looking into the structure of relatively free proonite objects whereas, for the second question, a general approach is presented which is suuciently powerful to allow the calculation of many semidirect products. A systematic translation of bases of pseudoidenti-ties of pseudovarieties of categories into characterizations of semidirect products of pseudovarieties of semigroups is given. The latter characterizations, of a syntactic nature, are not eeective but may in many cases be reduced to eeective characterizations. Several known results are derived as examples|including a syntactic proof of a generalization of the Delay Theorem|and further new applications are obtained using these techniques.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Free pro nite semigroups over semidirect products

We give a general description of the free proonite semigroups over a semidirect product of pseudovarieties. More precisely, A (V W) is described as a closed subsemigroup of a proonite semidirect product of the form A WA V A W. As a particular case, the free proonite semigroup over J 1 V is described in terms of the geometry of the Cayley graph of the free proonite semigroup over V (here J 1 is ...

متن کامل

Globals of Pseudovarieties of Commutative Semigroups: the Finite Basis Problem, Decidability, and Gaps

Whereas pseudovarieties of commutative semigroups are known to be nitely based, the globals of monoidal pseudovarieties of commutative semi-groups are shown to be nitely based (or of nite vertex rank) if and only if the index is 0, 1 or !. Nevertheless, on these pseudovarieties, the operation of taking the global preserves decidability. Furthermore, the gaps between many of these globals are sh...

متن کامل

Proonite Categories, Implicit Operations and Pseudovarieties of Categories

The last decade has seen two methodological advances of particular direct import for the theory of nite monoids and indirect import for that of rational languages. The rst has been the use of categories (considered as \algebras over graphs") as a framework in which to study monoids and their homomorphisms, the second has been the use of implicit operations to study pseudovarieties of monoids. S...

متن کامل

Syntactic methods in nite semigroup theory

This paper is a survey of recent results in the theory of nite semigroups using syntactic techniques. This involves manipulating pseudoidentities and the study of relatively free proonite semigroups, whose structure encodes algebraic and combinatorial properties common to the members of a pseudovariety of semigroups. These techniques are illustrated with applications in the study of semigroups ...

متن کامل

Hyperdecidable Pseudovarieties and the Calculation of Semidirect Products

This note introduces the notion of a hyperdecidable pseudovariety. This notion appears naturally in trying to prove decidability of the membership problem of semidirect products of pseudovarieties of semigroups. It turns out to be a generalization of a notion introduced by C. J. Ash in connection with his proof of the \type II" theorem. The main results in this paper include a formulation of th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007